Set Systems with No Singleton Intersection
نویسندگان
چکیده
منابع مشابه
Set Systems with No Singleton Intersection
Let F be a k-uniform set system defined on a ground set of size n with no singleton intersection; i.e., no pair A,B ∈ F has |A ∩ B| = 1. Frankl showed that |F| ≤ (n−2 k−2 ) for k ≥ 4 and n sufficiently large, confirming a conjecture of Erdős and Sós. We determine the maximum size of F for k = 4 and all n, and also establish a stability result for general k, showing that any F with size asymptot...
متن کاملSet systems with union and intersection constraints
Let 2 ≤ d ≤ k be fixed and n be sufficiently large. Suppose that G is a collection of k-element subsets of an n-element set, and |G| > ( n−1 k−1 ) . Then G contains d sets with union of size at most 2k and empty intersection. This verifies a conjecture of the first author for large n.
متن کاملSet Constraints with Intersection
Set constraints are inclusions between expressions denoting sets of trees. The eficiency of their satisfiabili ty test is a central issue in set-based program analysis, their main application domain. W e introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that i ts satisfiability problem as DEXPTIME-com...
متن کاملPrivate Set Intersection for Unequal Set Sizes with Mobile Applications
Private set intersection (PSI) is a cryptographic technique that is applicable to many privacy-sensitive scenarios. For decades, researchers have been focusing on improving its efficiency in both communication and computation. However, most of the existing solutions are inefficient for an unequal number of inputs, which is common in conventional client-server settings. In this paper, we analyze...
متن کاملSet Families with Low Pairwise Intersection
A (n, l, γ)-sharing set family of sizem is a family of sets S1, . . . , Sm ⊆ [n] s.t. each set has size l and each pair of sets shares at most γ elements. We let m (n, l, γ) denote the maximum size of any such set family and we consider the following question: How large can m (n, l, γ) be? (n, l, γ)-sharing set families have a rich set of applications including the construction of pseudorandom ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2006
ISSN: 0895-4801,1095-7146
DOI: 10.1137/050647372